for tc in range(int(input())):
N = int(input())
A = list(map(int, input().split()))
s, m = sum(A), max(A)
print('T\n' if s // 2 < m or s % 2 == 1 else 'HL\n')
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long LL;
const int N = 110;
int a[N];
int main()
{
int T;
cin >> T;
while(T -- )
{
int n;
cin >> n;
LL sum=0;
for(int i=1;i<=n;++i){
cin>>a[i];
sum+=a[i];
}
if(sum&1)puts("T");
else {
bool flag=false;
for(int i=1;i<=n;++i)
if(a[i]>sum/2)flag=true;
if(flag)puts("T");
else puts("HL");
}
}
return 0;
}
1632B - Roof Construction | 388A - Fox and Box Accumulation |
451A - Game With Sticks | 768A - Oath of the Night's Watch |
156C - Cipher | 545D - Queue |
459B - Pashmak and Flowers | 1538A - Stone Game |
1454C - Sequence Transformation | 165B - Burning Midnight Oil |
17A - Noldbach problem | 1350A - Orac and Factors |
1373A - Donut Shops | 26A - Almost Prime |
1656E - Equal Tree Sums | 1656B - Subtract Operation |
1656A - Good Pairs | 1367A - Short Substrings |
87A - Trains | 664A - Complicated GCD |
1635D - Infinite Set | 1462A - Favorite Sequence |
1445B - Elimination | 1656C - Make Equal With Mod |
567A - Lineland Mail | 1553A - Digits Sum |
1359B - New Theatre Square | 766A - Mahmoud and Longest Uncommon Subsequence |
701B - Cells Not Under Attack | 702A - Maximum Increase |